package 数论;

import java.util.Scanner;

public class 核桃数量 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int k = lcm(a, b);
        System.out.println(lcm(k, c));
    }
    //计算最大公约数
    static int god(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
    static int lcm(int a, int b) {
        return Math.abs(a * b) / god(a, b);
    }
}
